#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef struct
{
    double x;
    double y;
    double changdu;
} dian;
dian num[1000005];
int n;
double fun(double, double, double, double);
//sort快排规则
bool cmp(dian a, dian b)
{
    return a.changdu < b.changdu;
}
int main()
{
    /*
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    */
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        scanf("%lf %lf", &num[i].x, &num[i].y);
        //cin >> num[i].x >> num[i].y;
        num[i].changdu = fun(num[i].x, num[i].y, 0, 0);
    }
    sort(num, num + n, cmp);
    int re1 = -1, re2 = -1;
    //寻找经过排序后在坐标轴上的点
    for (int i = 0; i < n; i++)
    {
        if (num[i].x == 0 && re1 == -1)
            re1 = i;
        if (num[i].y == 0 && re2 == -1)
            re2 = i;
        if (re1 != -1 && re2 != -1)
            break;
    }
    double ans = 0;
    if (re1 != -1 && re2 != -1)
    {
        ans += fun(num[re1].x, num[re1].y, num[re2].x, num[re2].y);
        printf("%.10lf\n", ans);
    }
    else
    {
        cout << "Poor Little H!" << endl;
    }
    return 0;
}
double fun(double a, double b, double c, double d)
{
    double aaaaaa = sqrt((c - a) * (c - a) + (d - b) * (d - b));
    return aaaaaa;
}
